Intersection Properties of Polyhedral Norms
نویسنده
چکیده
We investigate the familyM of intersections of balls in a finite dimensional vector space with a polyhedral norm. The spaces for whichM is closed under Minkowski addition are completely determined. We characterize also the polyhedral norms for which M is closed under adding a ball. A subset P ofM consists of the Mazur sets K, defined by the property that for any hyperplane H not meeting K there is a ball containing K and not meeting H. We characterize the Mazur sets in terms of their normal cones and also as summands of closed balls. As a consequence, we characterize the polyhedral spaces with only trivial Mazur sets as those whose unit ball is indecomposable.
منابع مشابه
Continuity Properties of the Ball Hull Mapping
The ball hull mapping β associates with each closed bounded convex setK in a Banach space its ball hull β(K), defined as the intersection of all closed balls containing K. We are concerned in this paper with continuity and Lipschitz continuity (with respect to the Hausdorff metric) of the ball hull mapping. It is proved that β is a Lipschitz map in finite dimensional polyhedral spaces. Both pro...
متن کاملLinear optimization on the intersection of two fuzzy relational inequalities defined with Yager family of t-norms
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Yager family of t-norms is considered as fuzzy composition. Yager family of t-norms is a parametric family of continuous nilpotent t-norms which is also one of the most frequently appli...
متن کاملSome properties of a class of polyhedral semigroups based upon the subword reversing method
In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined.
متن کاملPolyhedral properties for the intersection of two knapsacks
We address the question to what extent polyhedral knowledge about individual knapsack constraints suffices or lacks to describe the convex hull of the binary solutions to their intersection. It turns out that the sign patterns of the weight vectors are responsible for the types of combinatorial valid inequalities appearing in the description of the convex hull of the intersection. In particular...
متن کامل